Distributed CSPs by graph partitioning
نویسندگان
چکیده
Nowadays, many real problems in artificial intelligence can be modelled as constraint satisfaction problems (CSPs). A general CSP is known to be NP-complete. Nevertheless, distributed models may reduce the exponential complexity by partitioning the problem into a set of subproblems. In this paper, we present a preprocess technique to break a single large problem into a set of smaller loosely connected ones. These semi-independent CSPs can be efficiently solved and, furthermore, they can be solved concurrently. 2006 Elsevier Inc. All rights reserved.
منابع مشابه
Nogood-FC for solving partitionable constraint satisfaction problems
Many real problems can be naturally modelled as constraint satisfaction problems (CSPs). However, some of these problems are of a distributed nature, which requires problems of this kind to be modelled as distributed constraint satisfaction problems (DCSPs). In this work, we present a distributed model for solving CSPs. Our technique carries out a partition over the constraint network using a g...
متن کاملDistributed Constraints for Large-Scale Scheduling Problems
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed models may reduce the exponential complexity by partitioning the problem into a set of subproblems. In this work, we present a distributed model for solving large-scale CSPs in which agents are committed to sets of con...
متن کاملDistributed Models for solving CSPs∗
Nowadays, many real problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete; so that closure and heuristic search are usually used. However, less effort has been focussed on distributed CSPs, where the problem complexity can be reduced by dividing the problem into a set of subproblems. In this work, we present two techniques for part...
متن کاملApplication of Meta-Tree-Based Distributed Search to the Railway Scheduling Problem∗
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete; however, distributed models may take advantage of dividing the problem into a set of simpler interconnected sub-problems which can be more easily solved. In this work, we present a distributed model for solving large-scale CSPs. Our ...
متن کاملDomain - dependent distributed models for railway scheduling q
Many combinatorial problems can be modelled as Constraint Satisfaction Problems (CSPs). Solving a general CSP is known to be NP-complete, so closure and heuristic search are usually used. However, many problems are inherently distributed and the problem complexity can be reduced by dividing the problem into a set of subproblems. Nevertheless, general distributed techniques are not always approp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Applied Mathematics and Computation
دوره 183 شماره
صفحات -
تاریخ انتشار 2006